403 research outputs found

    Controllability and motion algorithms for underactuated Lagrangian systems on Lie groups

    Full text link

    Moving constraints as stabilizing controls in classical mechanics

    Full text link
    The paper analyzes a Lagrangian system which is controlled by directly assigning some of the coordinates as functions of time, by means of frictionless constraints. In a natural system of coordinates, the equations of motions contain terms which are linear or quadratic w.r.t.time derivatives of the control functions. After reviewing the basic equations, we explain the significance of the quadratic terms, related to geodesics orthogonal to a given foliation. We then study the problem of stabilization of the system to a given point, by means of oscillating controls. This problem is first reduced to the weak stability for a related convex-valued differential inclusion, then studied by Lyapunov functions methods. In the last sections, we illustrate the results by means of various mechanical examples.Comment: 52 pages, 4 figure

    Network abstract linear programming with application to minimum-time formation control

    Full text link
    We identify a novel class of distributed optimization problems, namely a networked version of abstract linear programming. For such problems we propose distributed algorithms for networks with various connectivity and/or memory constraints. Finally, we show how various minimum-time formation control problems can be tackled through appropriate geometric examples of abstract linear programs

    Structural Balance via Gradient Flows over Signed Graphs

    Get PDF
    Structural balance is a classic property of signed graphs satisfying Heider's seminal axioms. Mathematical sociologists have studied balance theory since its inception in the 1940s. Recent research has focused on the development of dynamic models explaining the emergence of structural balance. In this paper, we introduce a novel class of parsimonious dynamic models for structural balance based on an interpersonal influence process. Our proposed models are gradient flows of an energy function, called the dissonance function, which captures the cognitive dissonance arising from violations of Heider's axioms. Thus, we build a new connection with the literature on energy landscape minimization. This gradient flow characterization allows us to study the transient and asymptotic behaviors of our model. We provide mathematical and numerical results describing the critical points of the dissonance function

    Saccades and smooth pursuit eye movements in central vertigo

    Get PDF
    In order to analyze the diagnostic efficiency of saccadic and pursuit eye movements compared to findings from brain magnetic resonance imaging in patients with central vertigo, 108 patients were selected from 580 dizzy patients as cases of suspected central origin; the saccadic and pursuit eye movements were evaluated by electronystagmography and findings were compared to information from magnetic resonance imaging. The study of oculomotor movements in patients suspected of having a central lesion revealed a 83.3% sensitivity and 21.2% specificity. Restricting consideration to severe alterations in eye movements as indicative of a central origin, this test gives a 71.4% sensitivity and 50.0% specificity. In conclusion, the study of alterations in oculomotor movements, in patients with suspected central lesions, proved to be a test with good sensitivity also compared with results of magnetic resonance imaging

    Synchronization in Complex Oscillator Networks and Smart Grids

    Full text link
    The emergence of synchronization in a network of coupled oscillators is a fascinating topic in various scientific disciplines. A coupled oscillator network is characterized by a population of heterogeneous oscillators and a graph describing the interaction among them. It is known that a strongly coupled and sufficiently homogeneous network synchronizes, but the exact threshold from incoherence to synchrony is unknown. Here we present a novel, concise, and closed-form condition for synchronization of the fully nonlinear, non-equilibrium, and dynamic network. Our synchronization condition can be stated elegantly in terms of the network topology and parameters, or equivalently in terms of an intuitive, linear, and static auxiliary system. Our results significantly improve upon the existing conditions advocated thus far, they are provably exact for various interesting network topologies and parameters, they are statistically correct for almost all networks, and they can be applied equally to synchronization phenomena arising in physics and biology as well as in engineered oscillator networks such as electric power networks. We illustrate the validity, the accuracy, and the practical applicability of our results in complex networks scenarios and in smart grid applications

    Optimal path planning for nonholonomic robotics systems via parametric optimisation

    Get PDF
    Abstract. Motivated by the path planning problem for robotic systems this paper considers nonholonomic path planning on the Euclidean group of motions SE(n) which describes a rigid bodies path in n-dimensional Euclidean space. The problem is formulated as a constrained optimal kinematic control problem where the cost function to be minimised is a quadratic function of translational and angular velocity inputs. An application of the Maximum Principle of optimal control leads to a set of Hamiltonian vector field that define the necessary conditions for optimality and consequently the optimal velocity history of the trajectory. It is illustrated that the systems are always integrable when n = 2 and in some cases when n = 3. However, if they are not integrable in the most general form of the cost function they can be rendered integrable by considering special cases. This implies that it is possible to reduce the kinematic system to a class of curves defined analytically. If the optimal motions can be expressed analytically in closed form then the path planning problem is reduced to one of parameter optimisation where the parameters are optimised to match prescribed boundary conditions.This reduction procedure is illustrated for a simple wheeled robot with a sliding constraint and a conventional slender underwater vehicle whose velocity in the lateral directions are constrained due to viscous damping
    • …
    corecore